UML Modeling of a Protocol for Establishing Mutual Exclusion in Distributed Computer System
نویسندگان
چکیده
Mutual Exclusion in a fully distributed computer system contains a lot of complexities related to the solution design and its implementation. A number of solutions have been proposed for solving mutual exclusion problem for fully distributed environment but most of them are related to higher message passing overheads over the network, which causes low performance and efficiency. In this paper authors have presented a design of a protocol for establishing mutual exclusion among processes running concurrently, in fully distributed environment by the use of bidirectional ring technique. A well known modeling approach i.e. Unified Modeling Language (UML) is used to model the protocol. UML class diagram, sequence diagrams related to various scenarios is designed and system complexities are also measured.
منابع مشابه
An Improved Token-Based and Starvation Free Distributed Mutual Exclusion Algorithm
Distributed mutual exclusion is a fundamental problem of distributed systems that coordinates the access to critical shared resources. It concerns with how the various distributed processes access to the shared resources in a mutually exclusive manner. This paper presents fully distributed improved token based mutual exclusion algorithm for distributed system. In this algorithm, a process which...
متن کاملUML-based Approach to Specify Secured, Fine-grained Concurrent Access to Shared Resources
In object oriented paradigm, a concurrent system can be regarded as a collection of autonomous active objects which synchronize and communicate through shared passive objects. In this paper, we propose a UML-based approach to specify secured, fine-grained concurrent access to shared resources ensuring data integrity and security. The goal of the approach is to develop the UML specification with...
متن کاملAspect-Oriented Modeling of Mutual Exclusion in UML State Machines
Mutual exclusion is a very common requirement in parallel systems. Yet its modeling is a tedious task in UML state machines, one of the most popular languages for behavior modeling. We present HiLA, an aspect-oriented extension of UML state machines, to address this problem. In HiLA, mutual exclusion can be modeled in a highly modular and declarative way. That is, the logic of mutual exclusion ...
متن کاملModeling and Verification of a Dynamic Information Structure Distributed Mutual Exclusion Algorithm Using Spin
In a distributed system, mutual exclusion is a condition which ensures that a shared resource in the system can be accessed by one and only one process at a time. Mutual exclusion ensures that only one process can be in its critical section at a time. Many distributed mutual exclusion algorithms have been proposed and verified [1][2][3][4][5]. In this paper, we have modeled and verified the dyn...
متن کاملComputer Science Technical Report Mutual Exclusion Between Neighboring Nodes in a Tree That Stabilizes Using Read/Write Atomicity?
Our purpose in this paper is to propose a new protocol that can ensure mutual exclusion between neighboring nodes in a tree struc-tured distributed system, i.e., under the given protocol no two neighboring nodes can execute their critical sections concurrently. This protocol can be used to run a serial model self stabilizing algorithm in a distributed environment that accepts as atomic operatio...
متن کامل